In M2M networks, most nodes are powered by battery; hence the overused nodes may easily be out of power, which causes the\r\nreduction of network lifetime. To solve this problem, it is helpful to balance network load into more nodes and links, so as to reduce\r\nnetwork congestion. Multipath routing is a useful tool to reduce congestion, since data flow can be dispersed into multiple paths.\r\nHowever, most of the previous multipath routing algorithm is based on the path disjoint constraint, which leads to the lack of\r\nrouting paths and the failure to disperse data flow into more links. In this paper, a directed acyclic graph based multipath routing\r\nalgorithmfor congestion minimization (DAGMR)is proposed,where different routing paths are confined in a directed acyclic graph\r\n(DAG) under time delay constraint. Furthermore, the data flow distribution is accomplished through partial capacity network to\r\nobtain the minimalmultipath routing congestion factor. Simulation indicates that our algorithm can obtain lower congestion factor\r\nand formulates multipath routing graph with more nodes and links than algorithm with path disjoint constraint. In addition, our\r\nalgorithm is a polynomial time complexity algorithm with nodes and links number of the entire network.
Loading....